An Adaptive Proximity Route Selection Method in DHT-Based Peer-to-Peer Systems
نویسندگان
چکیده
منابع مشابه
An Adaptive Proximity Route Selection Scheme in DHT-Based Peer to Peer Systems
This paper presents a proximity route selection scheme which is adaptive to the underlying network conditions. The proposed scheme repeatedly estimates and updates the total lookup latency based on the information from the neighborhoods. The updated information is used to select the next peer dynamically to route the query, which results in reducing the overall lookup latency. We implemented th...
متن کاملAdaptive Peer-to-Peer Routing with Proximity
In this paper, we presented a routing strategy for requests in unstructured peer-to-peer networks. The strategy is based on the adaptive routing Q-routing. The strategy uses reinforcement learning to estimate the cost of routing a request. Such a strategy is scalable only if the routing indices are of reasonable size. We proposed and comparatively evaluated three methods for the pruning for the...
متن کاملComplex Queries in DHT-based Peer-to-Peer Networks
Recently a new generation of P2P systems, offering distributed hash table (DHT) functionality, have been proposed. These systems greatly improve the scalability and exact-match accuracy of P2P systems, but offer only the exact-match query facility. This paper outlines a research agenda for building complex query facilities on top of these DHT-based P2P systems. We describe the issues involved a...
متن کاملReducing Maintenance Overhead in DHT Based Peer-to-Peer Algorithms
DHT based Peer-to-Peer (P2P) algorithms are very promising for their efficient routing performance. However, most commercial P2P systems donot adapt DHT algorithms and still use central facilities or broadcasting based routing mechanisms. One reason impeding the DHT algorithm popularity is the routing information maintenance overhead in DHT algorithms, it generates considerable network traffic ...
متن کاملProof: A Novel DHT-Based Peer-to-Peer Search Engine
In this paper we focus on building a large scale keyword search service over structured Peer-to-Peer (P2P) networks. Current stateof-the-art keyword search approaches for structured P2P systems are based on inverted list intersection. However, the biggest challenge in those approaches is that when the indices are distributed over peers, a simple query may cause a large amount of data to be tran...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The KIPS Transactions:PartA
سال: 2006
ISSN: 1598-2831
DOI: 10.3745/kipsta.2006.13a.1.011